Incremental Connected Component Detection for Graph Streams on GPU
نویسندگان
چکیده
Studies on the real-time detection of connected components in graph streams have been carried out. The existing component method cannot process incrementally, and performance deteriorates due to frequent data transmission when GPU is used. In this paper, we propose a new incremental processing solve problems found methods for detecting GPUs. proposed minimizes amount be sent by determining subgraph affected stream update part recalculated. We consider number vertices quickly determine GPU. An asynchronous execution used shorten transfer time between CPU according changes. order show that provides fast GPU, evaluated its using various datasets.
منابع مشابه
Strongly Connected Components in Graph Streams
Frequently studied networks, such as social networks, are often massive, directed, and change over time. Thus studying network analysis algorithms in terms of data streaming is a practical model for understanding how companies and other organizations can process data in a useful, realistic way. One potentially interesting feature of a directed graph is strongly connected components. We design a...
متن کاملSome GPU Algorithms for Graph Connected Components and Spanning Tree
Graphics Processing Units (GPU) are application specific accelerators which provide high performance to cost ratio and are widely available and used, hence places them as a ubiquitous accelerator. A computing paradigm based on the same is the general purpose computing on the GPU (GPGPU) model. The GPU due to its graphics lineage is better suited for the data-parallel, data-regular algorithms. T...
متن کاملConnected Sub-graph Detection
We characterize the family of connected subgraphs in terms of linear matrix inequalities (LMI) with additional integrality constraints. We then show that convex relaxations of the integral LMI lead to parameterization of all weighted connected subgraphs. These developments allow for optimizing arbitrary graph functionals under connectivity constraints. For concreteness we consider the connected...
متن کاملIncremental Principal Component Analysis Based Outlier Detection Methods for Spatiotemporal Data Streams
In this paper, we address outliers in spatiotemporal data streams obtained from sensors placed across geographically distributed locations. Outliers may appear in such sensor data due to various reasons such as instrumental error and environmental change. Realtime detection of these outliers is essential to prevent propagation of errors in subsequent analyses and results. Incremental Principal ...
متن کاملOn the existence of a connected component of a graph
We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to ACA0 over RCA0. The problem of decomposing a countable graph into connected components is strongly Weihrauch equivalent to the problem of finding a single component, and each is equivalent to its infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12061465